Minimum Length Minimum Delay Scheduling Using Artificial Butterfly Optimization (ABO) Algorithm in Manet
نویسندگان
چکیده
منابع مشابه
Optimization of DCF Length with Minimum BER using SMF
In this report the analysis of optimum DCF Length for minimum bit error rate (BER) in SMF is done. With the aid of optsim simulation tool a DCF is employed with the proper variation in length to overcome the non linearity to get the minimum BER. Better performance was shown when the combination of SMF Length 90Km and DCF Length 12Km was chosen. At this particular value the minimum BER was obtai...
متن کاملMinimum-Perturbation Retiming for Delay Optimization
This paper describes a fast retiming algorithm targeting delay while minimizing the number of flip-flops moved. The algorithm can be applied before placement to minimize logic level, or after placement to minimize the critical region annotated with wire delays. Experiments on a suite of industrial benchmarks show that the algorithm improves fMAX by 9% while increasing LUT count by 1% and flip-f...
متن کاملA Minimum Delay Routing Algorithm Using Distributed Computation
generalized vertex median of a weighted graph,” Operations Res., pp. 955-961, July 1967. R. R. Trippi, “The warehouse location formulation as a special type of inspection problem,”Managemenr Sei., vol. 21, pp. 986988, May 1975. L. S. Woo and D. T. Tang, “Optimization of teleprocessing networks with concentrators,” in Conf. Rec., Nat. Telecommun. Con$, Atlanta, GA, Nov. 26-28, 1973, pp. 37C1-3...
متن کاملMultilevel Minimum Cross Entropy Thresholding using Artificial Bee Colony Algorithm
The minimum cross entropy thresholding (MCET) has been widely applied in image processing. In this paper, a new multilevel MCET algorithm based on the artificial bee colony (ABC) algorithm is proposed. The proposed thresholding algorithm is called ABC-based MCET algorithm. Four different methods including the exhaustive search, the honey bee mating optimization (HBMO), the particle swarm optimi...
متن کاملA Minimum Output Burstiness Traffic Scheduling Algorithm
In this paper, we present a traffic scheduling algorithm, called the Delay-Bound Monotonic with Average Rate Reservation (DM/ARR), which generates minimum output burstiness streams. We assume that connection i is policed by the leaky bucket algorithm with parameters (σi, ρi) where σi is the bucket size (or burstiness) and ρi is the leaky rate. Compared with the totally isolated scheme where con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOP Conference Series: Materials Science and Engineering
سال: 2020
ISSN: 1757-899X
DOI: 10.1088/1757-899x/993/1/012053